Uniform Compression Functions Can Fail to Preserve "Full" Entropy

نویسنده

  • Daniel R. L. Brown
چکیده

To have “full” entropy has been defined in a draft NIST standard to be to have min-entropy very close, proportionally, to the min-entropy of a uniform distribution. A function is uniform if all its preimages have the same size. This report proves that the output of any uniform compression function can fail to have full entropy, even when the input has full entropy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exergy and Energy Analysis of Diesel Engine using Karanja Methyl Ester under Varying Compression Ratio

The necessity for decrease in consumption of conventional fuel, related energy and to promote the use of renewable sources such as biofuels, demands for the effective evaluation of the performance of engines based on laws of thermodynamics. Energy, exergy, entropy generation, mean gas temperature and exhaust gas temperature analysis of CI engine using diesel and karanja methyl ester blends at d...

متن کامل

Partial N-grams

This work presents a new model, called a partial n-gram, in which probability estimates for only some patterns from the full joint distribution are kept. The main experimental result shows that a partial n-gram model for one value of n can have better predictive performance than a full n-gram model for a smaller n where the two models have the same number of parameters. N-grams serve as one of ...

متن کامل

A Graph Coloring Problem with Applications to Data Compression

We study properties of graph colorings that minimize the quantity of color information with respect to a given probability distribution P on the vertices of the graph. The minimum entropy of any coloring of such a probabilistic graph (G,P ) is the chromatic entropy Hχ(G,P ). Applications of the chromatic entropy are found in data compression with side information at the receiver and digital ima...

متن کامل

Implications of Mixing Properties on Intrinsic Ergodicity in Symbolic Dynamics

We study various mixing properties for subshifts, which allow words in the language to be concatenated into a new word in the language given certain gaps between them. All are defined in terms of an auxiliary gap function f : N → N, which gives the minimum required gap length as a function of the lengths of the words on either side. In this work we focus mostly on topological transitivity, topo...

متن کامل

Bayesian Estimation of Shift Point in Shape Parameter of Inverse Gaussian Distribution Under Different Loss Functions

In this paper, a Bayesian approach is proposed for shift point detection in an inverse Gaussian distribution. In this study, the mean parameter of inverse Gaussian distribution is assumed to be constant and shift points in shape parameter is considered. First the posterior distribution of shape parameter is obtained. Then the Bayes estimators are derived under a class of priors and using variou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012